Dimension Extractors and Optimal Decompression
نویسندگان
چکیده
منابع مشابه
Dimension Extractors
A dimension extractor is an algorithm designed to increase the effective dimension – i.e., the computational information density – of an infinite sequence. A constructive dimension extractor is exhibited by showing that every sequence of positive constructive dimension is Turing equivalent to a sequence of constructive strong dimension arbitrarily close to 1. Similar results are shown for compu...
متن کاملTowards Optimal Randomness Extractors and Ramsey Graphs
I will survey some of the recent exciting progress on explicit constructions of randomness extractors for independent sources. Many of the new constructions rely on explicit constructions of newly introduced pseudorandom primitives, and there remains scope of finding better explicit constructions of these primitives. I will also discuss some possible approaches for constructing optimal Ramsey g...
متن کاملNearly Optimal Language Compression Using Extractors
We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser Sip83] and Buhrman and Fortnow BF97]. We use extractors to extract the randomness of strings. In particular we show how to get from an arbitrary string, an incompressible string which enc...
متن کاملRound-Optimal Correlation Extractors with Linear Production and Leakage Resilience
Correlated private randomness, or correlation, in short, is a fundamental cryptographic resource that enables secure computation over private data. An offline preprocessing step, independent of the eventual secure computation, generates correlated secret shares for parties that the parties use during the online secure computation phase. However, these secret shares are vulnerable to leakage att...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2007
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-007-9024-7